New upper bounds for ∥ A − 1 ∥ ∞ of strictly diagonally dominant M-matrices
نویسندگان
چکیده
منابع مشابه
Some new sufficient conditions for generalized strictly diagonally dominant matrices
Generalized strictly diagonally dominant matrices have wide applications in science and engineering, but it is very difficult to determine whether a given matrix is a generalized strictly diagonally dominant matrix or not in practice. In this paper, we give several practical conditions for generalized strictly diagonally dominant matrices by constructing different positive diagonal matrix and a...
متن کاملSubdirect Sums of S-strictly Diagonally Dominant Matrices *
Conditions are given which guarantee that the k-subdirect sum of S-strictly diagonally dominant matrices (S-SDD) is also S-SDD. The same situation is analyzed for SDD matrices. The converse is also studied: given an SDD matrix C with the structure of a k-subdirect sum and positive diagonal entries, it is shown that there are two SDD matrices whose subdirect sum is C. AMS subject classifications...
متن کاملDoubly Diagonally Dominant Matrices
We consider the class of doubly diagonally dominant matrices (A = [ ajj] E C”, ‘, la,,1 l”jjl > Ck+ i laiklCk+ jlajkl. i #j) and its subclasses. We give necessary and sufficient conditions in terms of the directed graph for an irreducibly doubly diagonally dominant matrix to be a singular matrix or to be an H-matrix. As in the case of diagonal dominance, we show that the Schur complements of do...
متن کاملNew Relative Perturbation Bounds for Ldu Factorizations of Diagonally Dominant Matrices
This work introduces new relative perturbation bounds for the LDU factorization of (row) diagonally dominant matrices under structure-preserving componentwise perturbations. These bounds establish that if (row) diagonally dominant matrices are parameterized via their diagonally dominant parts and off-diagonal entries, then tiny relative componentwise perturbations of these parameters produce ti...
متن کاملAccurate SVDs of weakly diagonally dominant M-matrices
We present a new O(n 3) algorithm which computes the SVD of a weakly diagonally dominant M-matrix to high relative accuracy. The algorithm takes as an input the offdiagonal entries of the matrix and its row sums.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0696-2